THE NUMBER OF CONNECTED SPARSELY EDGED GRAPHS. IV: LARGE NONSEPARABLE GRAPHSWRIGHT EM.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 219-229; BIBL. 9 REF.Article

LONG PATHS IN SPARSE RANDOM GRAPHSBOLLOBAS B.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 3; PP. 223-228; BIBL. 5 REF.Article

Sparse Ramsey graphsNEŠETŘIL, J; RÖDL, V.Combinatorica (Print). 1984, Vol 4, Num 1, pp 71-78, issn 0209-9683Article

On the sum of the reciprocals of cycle lengths in sparse graphsGYARFAS, A; PROMEL, H. J; SZEMEREDI, E et al.Combinatorica (Print). 1985, Vol 5, Num 1, pp 41-52, issn 0209-9683Article

Ramsey properties of random graphsLUCZAK, T; RUCINSKI, A; VOGT, B et al.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 55-68, issn 0095-8956Article

A faster all-pairs shortest path algorithm for real-weighted sparse graphsPETTIE, Seth.Lecture notes in computer science. 2002, pp 85-97, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

On sparse subgraphs preserving connectivity propertiesFRANK, A; IBARAKI, T; NAGAMOCHI, H et al.Journal of graph theory. 1993, Vol 17, Num 3, pp 275-281, issn 0364-9024Article

On large induced trees and long induced paths in sparse random graphsSUEN, W. C. S.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 250-262, issn 0095-8956Article

On the p-connectedness of graphs: a surveyBABEL, L; OLARIU, S.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 11-33, issn 0166-218XConference Paper

Efficient algorithms for acyclic colorings of graphsCHEN, Z.-Z.Theoretical computer science. 2000, Vol 230, Num 1-2, pp 75-95, issn 0304-3975Article

The diameter of sparse random graphsFAN CHUNG; LINYUAN LU.Advances in applied mathematics (Print). 2001, Vol 26, Num 4, pp 257-279, issn 0196-8858Article

On variations of P₄-sparse graphsBRANDSTÄDT, Andreas; MOSCA, Raffaele.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 521-532, issn 0166-218X, 12 p.Article